أدخل كلمة أو عبارة بأي لغة 👆
اللغة:
ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT
في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:
- كيف يتم استخدام الكلمة في اللغة
- تردد الكلمة
- ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
- خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
- أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
- أصل الكلمة
optimal pursuit - ترجمة إلى الروسية
CLASS OF MATHEMATICAL PROBLEMS CONCERNED WITH CHOOSING AN OPTIMAL TIME TO TAKE A PARTICULAR ACTION
Optimal Stopping; Optimal Stopping problem
optimal pursuit
математика
оптимальное преследование
curve of pursuit
![[[Pierre Bouguer]]'s 1732 article studying pursuit curves](https://commons.wikimedia.org/wiki/Special:FilePath/BourguerCourbepoursuite1732.jpg?width=200 "[[Pierre Bouguer]]'s 1732 article studying pursuit curves")
![Curve of pursuit of vertices of a [[square]] (the [[mice problem]] for ''n''=4).](https://commons.wikimedia.org/wiki/Special:FilePath/Four point pursuit curve.gif?width=200 "Curve of pursuit of vertices of a [[square]] (the [[mice problem]] for ''n''=4).")
CURVE TRACED BY A PURSUER CHASING A PURSUEE
Curve of pursuit; Pursuit Curve
теория игр
кривая погони
optimal stopping problem
задача об оптимальной остановке
تعريف
fresh pursuit
n. immediate chase of a suspected criminal by a law enforcement officer, in which situation the officer may arrest the suspect without a warrant. It can also refer to chasing a suspect or escaped felon into a neighboring jurisdiction in an emergency, as distinguished from entering another jurisdiction with time to alert law enforcement people in that area. Example: when a deputy sheriff from Montgomery County pursues a car driven by a suspected bank robber into Baltimore County (in which he normally has no power to enforce the law), the doctrine of fresh pursuit allows him/her to make the arrest. It is also called hot pursuit.
See also: hot pursuit
ويكيبيديا
Optimal stopping
In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.
